Renormalization group approach to multiple-arc random matrix models
نویسندگان
چکیده
منابع مشابه
Renormalization Group Approach to Matrix Models
Abstract. Matrix models of 2D quantum gravity are either exactly solvable for matter of central charge c ≤ 1, or not understood. It would be useful to devise an approximate scheme which would be reasonable for the known cases and could be carried to the unsolved cases in order to achieve at least a qualitative understanding of the properties of the models. The double scaling limit is an indicat...
متن کاملLarge N Renormalization Group for Random Matrix Models
We report on our recent studies of the large N renormalization group (RG) method which clariies phase structure of random matrix models. We derive an exact RG equation which enables us to obtain the exact locations of xed points and their scaling exponents. The classiication of phases is given by this analysis. A linear approximation visualizes the RG ow of crossover phenomena including several...
متن کاملRenormalization Group Approach to Generalized Cosmological models
It is widely accepted that Einstein’s general theory of relativity is an effective four-dimensional theory at lower energies and that it needs modifications at high energies. In the cosmological context, this break down of the theory results in a modification of the Friedmann equation with important consequences in the dynamical evolution at early times (see for example, [1, 2]). There has been...
متن کاملRenormalization-Group Approach to the Critical Behavior of Random-Spin Models
A renormalization-group technique is used to study the critical behavior of spin models in which each interaction has a small independent random width about its average value. The cluster approximation of Niemeyer and Van Leeuwen indicates that the two-dimensional Ising model has the same critical behavior as the homogeneous system. The ε expansion for n-component continuous spins shows that th...
متن کاملRenormalization group approach to satisfiability
Satisfiability is a classic problem in computational complexity theory, in which one wishes to determine whether an assignment of values to a collection of Boolean variables exists in which all of a collection of clauses composed of logical ORs of these variables is true. Here, a renormalization group transformation is constructed and used to relate the properties of satisfiability problems wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters B
سال: 1997
ISSN: 0370-2693
DOI: 10.1016/s0370-2693(97)00196-2